On equivalence of cyclic and dihedral zero-divisor codes having nilpotents of nilpotency degree two as generators

نویسندگان

چکیده

Abstract Zero-divisor codes are constructed using group rings where their generators zero-divisors. Generally, zero-divisor can be equivalent despite associated groups non-isomorphic, leading to the proposed conjecture “Every dihedral code has an form of cyclic code”. This paper is devoted study equivalence in $$F_2G$$ F 2 G having from 2-nilradical , consisting all nilpotents nilpotency degree 2 . Essentially, algebraic structures 2-nilradicals first studied general for both commutative and non-commutative before specialized into case when G dihedral. Then, results used above cases respective 2-nilradicals.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On zero-divisor graphs of quotient rings and complemented zero-divisor graphs

For an arbitrary ring $R$, the zero-divisor graph of $R$, denoted by $Gamma (R)$, is an undirected simple graph that its vertices are all nonzero zero-divisors of $R$ in which any two vertices $x$ and $y$ are adjacent if and only if either $xy=0$ or $yx=0$. It is well-known that for any commutative ring $R$, $Gamma (R) cong Gamma (T(R))$ where $T(R)$ is the (total) quotient ring of $R$. In this...

متن کامل

the effect of teaching reading as whole text task and paragraph task on efl learners speaking

abstract the present study was conducted to investigate the effectiveness of a rather newly developed method in language teaching that is the use of paragraph reading task and whole reading task and their effects on improving efl learner’s speaking ability. to fulfill the purpose of the study, first 90 participants studying their course at sa eedi high school in tehran were chosen by means of ...

15 صفحه اول

THE ZERO-DIVISOR GRAPH OF A MODULE

Let R be a commutative ring with identity and M an R-module. In this paper, we associate a graph to M, sayΓ(RM), such that when M=R, Γ(RM) coincide with the zero-divisor graph of R. Many well-known results by D.F. Anderson and P.S. Livingston have been generalized for Γ(RM). We Will show that Γ(RM) is connected withdiam Γ(RM)≤ 3 and if Γ(RM) contains a cycle, then Γ(RM)≤4. We will also show tha...

متن کامل

Median and Center of Zero-Divisor Graph of Commutative Semigroups

For a commutative semigroup S with 0, the zero-divisor graph of S denoted by &Gamma(S) is the graph whose vertices are nonzero zero-divisor of S, and two vertices x, y are adjacent in case xy = 0 in S. In this paper we study median and center of this graph. Also we show that if Ass(S) has more than two elements, then the girth of &Gamma(S) is three.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Designs, Codes and Cryptography

سال: 2022

ISSN: ['0925-1022', '1573-7586']

DOI: https://doi.org/10.1007/s10623-022-01025-3